On the Range of the Hankel and Extended Hankel Transforms
نویسندگان
چکیده
منابع مشابه
Fast Hankel Transforms
JOHANSEN, H. K., and SORENSEN, K., 1979, Fast Hankel Transforms, Geophysical Prospecting 27, 876-901. Inspired by the linear filter method introduced by D. P. Ghosh in rg7o we have developed a general theory for numerical evaluation of integrals of the Hankel type: m g(r) = Sf(A)hJ,(Ar)dh; v > I. II Replacing the usual sine interpolating function by sinsh (x) = a . sin (xx)/sinh (UTW), where th...
متن کاملdeterminant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولHankel matrix transforms and operators
Correspondence: homidan@kfupm. edu.sa Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, P. O. Box 119, Saudi Arabia Abstract Hankel operators and Hankel transforms are required in a number of applications. This article proves a number of theorems that efficiently and accurately approximates a function using Hankel transforms and Hankel sum....
متن کاملExtremal Vector Valued Inequalities for Hankel Transforms
The disc multiplier may be seen as a vector valued operator when we consider its projections in terms of the spherical harmonics. In this form, it represents a vector valued Hankel transform. We know that, for radial functions, it is bounded on the spaces Lplq (r n−1 dr) when 2n n+1 < p, q < 2n n−1 . Here we prove that there exist weak-type estimates for this operator for the extremal exponents...
متن کاملFast Polynomial Transforms Based on Toeplitz and Hankel Matrices
Many standard conversion matrices between coefficients in classical orthogonal polynomial expansions can be decomposed using diagonally-scaled Hadamard products involving Toeplitz and Hankel matrices. This allows us to derive O(N(logN)) algorithms, based on the fast Fourier transform, for converting coefficients of a degree N polynomial in one polynomial basis to coefficients in another. Numeri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1997
ISSN: 0022-247X
DOI: 10.1006/jmaa.1997.5351